Indifferentiability of 8-Round Feistel Networks
نویسندگان
چکیده
We prove that a balanced 8-round Feistel network is indifferentiable from a random permutation, improving on previous 10-round results by Dachman-Soled et al. and Dai et al. Our simulator achieves securityO(q/2), similarly to the security of Dai et al. For further comparison, Dachman-Soled et al. achieve security O(q/2), while the original 14-round simulator of Holenstein et al. achieves security O(q/2).
منابع مشابه
Feistel Networks: Indifferentiability at 8 Rounds
We prove that a balanced 8-round Feistel network is indifferentiable from a random permutation. This result comes on the heels of (and is part of the same body of work as) a 10-round indifferentiability result for Feistel network recently announced by the same team of authors [10]. The current 8-round simulator achieves similar security, query complexity and runtime as the 10-round simulator an...
متن کاملOn the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
We show that the Feistel construction with six rounds and random round functions is publicly indifferentiable from a random invertible permutation (a result that is not known to hold for full indifferentiability). Public indifferentiability (pub-indifferentiability for short) is a variant of indifferentiability introduced by Yoneyama et al. [29] and Dodis et al. [12] where the simulator knows a...
متن کاملIndifferentiability of 10-Round Feistel Networks
We prove that a (balanced) 10-round Feistel network is indifferentiable from a random permutation. In a previous seminal result, Holenstein et al. [17] had established indifferentiability of Feistel at 14 rounds. Our simulator achieves security O(q/2), runtime O(q) and query complexity O(q), to be compared with security O(q/2), runtime O(q) and query complexity O(q) for the 14-round simulator o...
متن کاملA Note on the Indifferentiability of the 10-Round Feistel Construction
Holenstein et al. (STOC 2011) have shown that the Feistel construction with fourteen rounds and public random round functions is indifferentiable from a random permutation. In the same paper, they pointed out that a previous proof for the 10-round Feistel construction by Seurin (PhD thesis) was flawed. However, they left open the question of whether the proof could be patched (leaving hope that...
متن کاملEquivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited
We consider the cryptographic problem of constructing an invertible random permutation from a public random function (i.e., which can be accessed by the adversary). This goal is formalized by the notion of indifferentiability of Maurer et al. (TCC 2004). This is the natural extension to the public setting of the well-studied problem of building random permutations from random functions, which w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016